Low Bit Rate Image Compression with Orthogonal Projection Pursuit Neural Networks
نویسندگان
چکیده
A new multiresolution algorithm for image compression based on projection pursuit neural networks is presented. High quality low bit-rate image compression is achieved first by segmenting an image into regions of different sizes based on perceptual variation in each region and then constructing a distinct code for each block by using the orthogonal projection pursuit neural networks. This algorithm allows one to adaptively construct a better approximation for each block by optimally selecting the basis functions from a universal set. The convergence is guaranteed by orthogonalizing the selected bases at each iteration. The coefficients of the approximations are obtained by back-projection with convex combinations. Our experimental results shows that at rates below 0.5 bits/ pixel, this algorithm shows excellent performance both in terms of PSNR and subjective image quality.
منابع مشابه
Image Compression and Signal Classification by Neural Networks and Projection Pursuits
In this report, two applications of neural networks are investigated. The first one is low bit rate image compression by using neural networks and projection pursuit. The second one is improving the classification accuracy of neural network classifiers by using unlabeled data. In the first part, a novel approach for low bit rate image coding is presented. The image is compressed by first quadtr...
متن کاملMultiresolution segmentation-based image coding with hierarchical data structures
This paper presents two multiresolution segmentation-based algorithms for low bit rate image compression using hierarchical data structures. The segmentation is achieved with quadtree and BSP-tree hierarchical data structures and the encoding is performed by using the projection pursuit (matching pursuit) with a finite dictionary of spline functions with various degrees of smoothness. Compariso...
متن کاملImage Compression by Parameterized-Model Coding of Wavelet Packet Near-Best Bases
Top-down tree search algorithms with non-additive information cost comparisons as decision criteria have recently been proposed by Taswell for the selection of near-best bases in wavelet packet transforms. Advantages of top-down non-additive near-best bases include faster computation speed, smaller memory requirement, and extensibility to biorthogonal wavelets in addition to orthogonal wavelets...
متن کاملMixed-Resolution Image Representation and Compression with Convolutional Neural Networks
In this paper, we propose a end-to-end mixed-resolution image compression framework with convolutional neural networks. Firstly, given one input image, feature description neural network (FDNN) is used to generate a new representation of this image, so that this image representation can be more efficiently compressed by standard coder, as compared to the input image. Furthermore, we use postpro...
متن کاملDetection, Synchronization, Channel Estimation and Capacity in UWB Sensor Networks using Compressed Sensing
Detection, Synchronization, Channel Estimation and Capacity in UWB Sensor Networks using Compressed Sensing by Shao-Yuan Chen Chair: Wayne E. Stark Conventional receivers in ultrawideband (UWB) communication system usually require high sampling rate and thus consume much power. With compressed sensing (CS), the sampling rate can potentially be reduced. In this thesis, the performance of CS used...
متن کامل